Mathemati al Programming manus ript No. (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Adversary model
• List update problem
• K-server problem
• Algorithm
• Randomized algorithm
• Competitive analysis
• Metrical task system

Online Algorithms Susanne Albers University of Freiburg, Germany 1 Introduction This book chapter reviews fundamental concepts and results in the area of

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Competitive analysis
• Adversary model
• List update problem
• Metrical task system
• K-server problem
• Randomized algorithm
• Algorithm
• Page replacement algorithm
• Ski rental problem

C:/Users/Bin/Dropbox/forINFO/INFOR12.dvi

Source URL: www.winlab.rutgers.edu

• Pickup trucks
• Outlier
• Statistical analysis
• Adversary model
• Truck
• Ram Trucks

Online Algorithms Susanne Albers Stefano Leonardiy Over the past twelve years, online algorithms have received considerable research interest. Online

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Theoretical computer science
• Metrical task system
• K-server problem
• Adversary model
• Algorithm
• Competitive analysis
• Randomized algorithm
• Approximation algorithm
• Computational learning theory

Adversary Gain vs. Defender Loss in Quantified Information Flow Piotr Mardziel,† Mário S. Alvim,‡ and Michael Hicks,† † University of Maryland, College Park ‡ Universidade Federal de Minas Gerais

Source URL: software.imdea.org

• Analysis of algorithms
• Online algorithms
• Adversary model

Optimal Projective Algorithms for the List Update Problem Christoph Amb¨uhl1 , Bernd G¨artner1 , and Bernhard von Stengel2 1 Institute for Theoretical Computer Science, ETH Z¨urich, 8092 Z¨urich, Switzerland.

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• Computer science
• Mathematics
• Applied mathematics
• Competitive analysis
• List update problem
• Algorithm
• Permutation
• Adversary model
• Homography

Theoretical Computer Science–16 www.elsevier.com/locate/tcs A new lower bound for the list update problem in the partial cost model

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• List update problem
• Competitive analysis
• Adversary model
• Algorithm
• K-server problem

3 Scientific Information 3.1

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Analysis of algorithms
• Online algorithms
• Computer science
• Theory of computation
• Competitive analysis
• List update problem
• Adversary model
• Algorithm
• Randomized algorithm
• Travelling salesman problem
• Time complexity

An Information-Theoretic Model for Steganography∗ Christian Cachin† March 3, 2004 Abstract An information-theoretic model for steganography with a passive adversary is proposed.

Source URL: eprint.iacr.org

Microsoft Word - gosler.doc

Source URL: dnnpro.outer.jhuapl.edu

• Electronic warfare
• Hacking
• Military technology
• Counter-intelligence
• Military intelligence
• Cyberwarfare
• Counterintelligence
• Adversary model
• Computer security
• Espionage
• Security
• Military science